Solutions for Multi-Hour Survivable Network Design Problems
نویسندگان
چکیده
Solving the multi-hour survivable network design problem entails finding the most cost efficient network design given two or more demand matrices that represent network traffic for different (busy-)hours. In addition to capacity installations, feasible routings that satisfy the traffic requirements for all of the demand matrices need to be determined. The problem is formulated as a mixed-integer programming model and the solution approach is based on a branch-and-cut framework that incorporates several classes of valid inequalities. Strategies for separating metric inequalities are presented and computational results are provided based on measurements from an operational network.
منابع مشابه
A Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملDesign of a Mathematical Model for Logistic Network in a Multi-Stage Multi-Product Supply Chain Network and Developing a Metaheuristic Algorithm
Logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. Transportation network design is then one of the most important fields of logistic network. This study is concerned with designing a multi-stage and multi-product logistic network. At first, a mixed integer nonlinear programming model...
متن کاملHierarchical approach for survivable network design
A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specif...
متن کاملMulti-commodity k-splittable survivable network design problems with relays
The network design problem is a well known optimization problem with applications in telecommunication, infrastructure designs and military operations. This paper devises the first formulation and solution methodology for the multi-commodity k-splittable two-edge disjoint survivable network design problem with capacitated edges and relays. This problem realistically portrays telecommunications ...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کامل